Applications of an Extended Set Constraint Solver

نویسندگان

  • Francisco Azevedo
  • Pedro Barahona
چکیده

1 {fa,pb}@di.fct.unl.pt Departamento de Informática, Universidade Nova de Lisboa 2825-114 Caparica — Portugal Abstract. In this paper we present some applications of a set constraint solver, Cardinal, that extends constraint solving to set variables with attached set functions and with special inferences over them. In particular, diagnosis of digital circuits and set covering problems are addressed with experimental results which are compared to other approaches to attest the expressiveness and efficiency of Cardinal. Future extensions of Cardinal are also discussed for other applications such as timetabling and other scheduling problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint Logic Programming over Infinite Domains with an Application to Proof

We present a CLP(FD)-based constraint solver able to deal with unbounded domains. It is based on constraint propagation, resorting to enumeration if all other methods fail. An important aspect is detecting when enumeration was complete and if this has an impact on the soundness of the result. We present a technique which guarantees soundness in the following way: if the constraint solver finds ...

متن کامل

Houria Iii: a Solver for Hierarchical Systems of Functional Constraints. Planning the Solution Graph for a Weighted Sum Criterion

Constraints allow programmers and users to state declaratively a relation that should be maintained, rather than requiring them to write procedures to maintain the relation themselves. They are thus useful in many applications such as user interface and simulation packages. In many situations, it is desirable to be able to state both hard and soft constraints. The hard constraints must hold, an...

متن کامل

Satisfiability Modulo Constraint Handling Rules (Extended Abstract)

Satisfiability Modulo Constraint Handling Rules (SMCHR) is the integration of the Constraint Handling Rules (CHRs) solver programming language into a Satisfiability Modulo Theories (SMT) solver framework. Constraint solvers are implemented in CHR as a set of high-level rules that specify the simplification (rewriting) and constraint propagation behavior. The traditional CHR execution algorithm ...

متن کامل

Modelling 0-1 Problems in CLP(PB)

Many practical problems involve constraints in 0-1 variables. We apply the constraint logic programming language CLP(PB) to model and reason about 0-1 problems. Given a set of possibly non-linear 0-1 constraints, the solver of CLP(PB) computes an equivalent set of extended clauses. By exploiting the metaprogramming facilities of the logic programming environment, we are able to deal with arbitr...

متن کامل

Simulation of Strap-On Boosters Separation in the Atmosphere

A numerical dynamic-aerodynamic interface for simulating the separation dy­n­a­m­ic­s of co­n­­s­t­r­a­i­ned strap-on boosters jettisoned in the atmosphere is presented. A 6-DOF multi body dynamic solver ،using Constraint For­ce Equation Methodology is coupled with a numerical time dependent Euler flow solver. An automatic dyna­m­i­­c mesh updating proc­e­d­ure is employed using smoothing and l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000